The largest proper congruence onS(X)
نویسندگان
چکیده
منابع مشابه
Proper Congruence - Preserving Extensions of Lattices
We prove that every lattice with more than one element has a proper congruence-preserving extension.
متن کاملAlgorithm for finding the largest inscribed rectangle in polygon
In many industrial and non-industrial applications, it is necessary to identify the largest inscribed rectangle in a certain shape. The problem is studied for convex and non-convex polygons. Another criterion is the direction of the rectangle: axis aligned or general. In this paper a heuristic algorithm is presented for finding the largest axis aligned inscribed rectangle in a general polygon. ...
متن کاملThe congruence subgroup problem ∗
This is a short survey of the progress on the congruence subgroup problem since the sixties when the first major results on the integral unimodular groups appeared. It is aimed at the non-specialists and avoids technical details.
متن کاملON THE CONGRUENCE ax
We give bounds on the number of solutions to the Diophantine equation (X +1/x)(Y +1/y) = n as n tends to infinity. These bounds are related to the number of solutions to congruences of the form ax + by ≡ 1 modulo xy.
متن کاملCongruence Lattices of Congruence Semidistributive Algebras
Nearly twenty years ago, two of the authors wrote a paper on congruence lattices of semilattices [9]. The problem of finding a really useful characterization of congruence lattices of finite semilattices seemed too hard for us, so we went on to other things. Thus when Steve Seif asked one of us at the October 1990 meeting of the AMS in Amherst what we had learned in the meantime, the answer was...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 1984
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171284000697